Pure Type Systems with Definitions
نویسندگان
چکیده
In this paper, an extension of Pure Type Systems (PTS's) with deenitions is presented. We prove this extension preserves many of the properties of PTS's. The main result is a proof that for many PTS's, including the Calculus of Constructions, this extension preserves strong normalisation.
منابع مشابه
Pure subtype systems : a type theory for extensible software
This thesis presents a novel approach to type theory called “pure subtype systems”, and a core calculus called DEEP which is based on that approach. DEEP is capable of modeling a number of interesting language techniques that have been proposed in the literature, including mixin modules, virtual classes, feature-oriented programming, and partial evaluation. The design of DEEP was motivated by t...
متن کاملSome new variants of interval-valued Gronwall type inequalities on time scales
By using an efficient partial order and concept of gH-differentiability oninterval-valued functions, we investigate some new variants of Gronwall typeinequalities on time scales, which provide explicit bounds on unknownfunctions. Our results not only unify and extend some continuousinequalities, but also in discrete case, all are new.
متن کاملA formalization of Γ∞ in Coq
In this paper we present a formalization of the type systems Γ∞ in the proof assistant Coq. The family of type systems Γ∞, described in a recent article by Geuvers, McKinna and Wiedijk [9], presents type theory without the need for explicit contexts. A typing judgment in Γ∞ is of the shape A :∞ B while an ordinary judgment is of the shape Γ ` A : B. This approach of Geuvers et al. makes a bridg...
متن کاملSingular Perturbation Theory in Output Feedback Control of Pure-Feedback Systems
This paper studies output feedback control of pure-feedback systems with immeasurable states and completely non-affine property. Since availability of all the states is usually impossible in the actual process, we assume that just the system output is measurable and the system states are not available. First, to estimate the immeasurable states a state observer is designed. Relatively fewer res...
متن کاملDomain-Free Pure Type Systems
Pure type systems make use of domain-full-abstractions x : D : M. We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free-abstractions x : M. Domain-free pure type systems have a number of advantages over both pure type systems and so-called type assignment systems (they also have some disadvantages) and have been used in theoretical developments...
متن کامل